Abstracting abstract machines

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correctly Optimizing Abstract Abstract Machines

The technique of abstracting abstract machines (AAM) provides a systematic approach for deriving computable approximations of evaluators that are easily proved sound. This article contributes a complementary step-by-step process for subsequently going from a naive analyzer derived under the AAM approach, to an efficient and correct implementation. The end result of the process is a two to three...

متن کامل

Abstract And-Parallel Machines

And-Parallel Machines* Nachum Dershowitz and Naomi Lindenstrauss Department of Computer Science, The Hebrew University, Jerusalem 91904, Israel The deterministic Turing machine, though abstract, can still be seen as a model of a realistic computer. The same cannot be said for the nondeterministic Turing machine as a model of parallel computing. We introduce several abstract machines with fine-g...

متن کامل

Interaction Abstract Machines

In this paper, we introduce the metaphor of Interaction Abstract Machines (IAMs), in the same vein of such metaphors as the Chemical Abstract Machine. The main point about IAMs is in allowing interactions among independent, locally deened subsystems | a crucial requirement for capturing the global behavior of open systems. IAMs amalgamate dual concepts in distributed problem solving, such as bl...

متن کامل

Recursive Abstract State Machines

According to the ASM thesis, any algorithm is essentially a Gurevich abstract state machine. The only objection to this thesis, at least in its sequential version, has been that ASMs do not capture recursion properly. To this end, we suggest recursive ASMs.

متن کامل

Typed Abstract State Machines

As introduced in the Lipari guide, Abstract State Machines (abbreviated as ASMs) are untyped. This is useful for many purposes. However, typed languages have their own advantages. Types structure the data, type checking uncovers errors. Here we propose a typed version of ASMs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications of the ACM

سال: 2011

ISSN: 0001-0782,1557-7317

DOI: 10.1145/1995376.1995400